XAMG: A library for solving linear systems with multiple right-hand side vectors
نویسندگان
چکیده
This paper presents the XAMG library for solving large sparse systems of linear algebraic equations with multiple right-hand side vectors. The specializes but is not limited to solution obtained from discretization elliptic differential equations. A corresponding set numerical methods includes Krylov subspace, multigrid, Jacobi, Gauss-Seidel, and Chebyshev iterative methods. parallelization implemented MPI+POSIX shared memory hybrid programming model, which introduces a three-level hierarchical decomposition using per-level synchronization communication primitives. code contains number optimizations, including multilevel data segmentation, compression indices, mixed-precision floating-point calculations, vector status flags, others. uses program well-known hypre construct multigrid matrix hierarchy. XAMG's own implementation solve phase provides up twofold speedup compared tests performed. Additionally, extended functionality
منابع مشابه
Solving Compressed Right Hand Side Equation Systems with Linear Absorption
In this paper we describe an approach for solving complex multivariate equation systems related to algebraic cryptanalysis. The work uses the newly introduced Compressed Right Hand Sides (CRHS) representation, where equations are represented using Binary Decision Diagrams (BDD). The paper introduces a new technique for manipulating a BDD, similar to swapping variables in the well-known siftingm...
متن کاملthe block lsmr algorithm for solving linear systems with multiple right-hand sides
lsmr (least squares minimal residual) is an iterative method for the solution of the linear system of equations and leastsquares problems. this paper presents a block version of the lsmr algorithm for solving linear systems with multiple right-hand sides. the new algorithm is based on the block bidiagonalization and derived by minimizing the frobenius norm of the resid ual matrix of normal equa...
متن کاملthe block lsmr method: a novel efficient algorithm for solving non-symmetric linear systems with multiple right-hand sides
it is well known that if the coefficient matrix in a linear system is large and sparse or sometimes not readily available, then iterative solvers may become the only choice. the block solvers are an attractive class of iterative solvers for solving linear systems with multiple right-hand sides. in general, the block solvers are more suitable for dense systems with preconditioner. in this paper,...
متن کاملComputing and deflating eigenvalues while solving multiple right hand side linear systems in Quantum Chromodynamics
We present a new algorithm that computes eigenvalues and eigenvectors of a Hermitian positive definite matrix while solving a linear system of equations with Conjugate Gradient (CG). The algorithm capitalizes on the vectors already available from CG, building a small window of vectors that approximates the eigenvectors. While this window is restarted in a locally optimal way, the CG is not. Our...
متن کاملNew variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs
In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SoftwareX
سال: 2021
ISSN: ['2352-7110']
DOI: https://doi.org/10.1016/j.softx.2021.100695